Distance distributions for graphs modeling computer networks
نویسندگان
چکیده
منابع مشابه
Distance distributions for graphs modeling computer networks
The Wiener polynomial of a graph G is a generating function for the distance distribution dd(G) = (D1,D2, . . . , Dt ), where Di is the number of unordered pairs of distinct vertices at distance i from one another and t is the diameter of G. We use the Wiener polynomial and several related generating functions to obtain generating functions for distance distributions of unweighted and weighted ...
متن کاملDistance distributions in random networks
To account for stochastic properties when modeling connectivity in wireless mobile systems such as cellular, ad-hoc and sensor networks, spatial points processes are used. Since connectivity can be expressed as a function of distance between nodes distance distributions between points in spatial processes are of special importance. In this paper we survey those results available for distance di...
متن کاملModeling Computer Networks for Emulation
performance analysis of distributed applications and protocols. An emulation scenario consists of a network topology, link parameters, and dynamic change models. In order to set up a scenario automatically, it has to be modeled in an appropriate description language. In this paper, we analyze the requirements for an emulation scenario description language and propose a possible solution.
متن کاملComputer Generation of Distance Polynomials of Graphs
A computer program is developed to compute distance polynomials of graphs containing up to 200 vertices. The code also computes the eigenvalues and the eigenvectors of the distance matrix. It requires as input only the neighborhood information from which the program constructs the distance matrix. The eigenvalues and eigenvectors are computed using the Givens-Householder method while the charac...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.07.020